1. Lin, Bertrand M.T.
  2. Liu, Duen-Ren
  3. Tsai, Min-Jen
  4. Li, Yung-Ming
  5. Ku, Cheng-Yuan
  6. Chen, Po-An
  7. Chuang, Yung-Ting

Lin, Bertrand M.T.

Professor

Office

Management Building 2 MB310

Extension

57410, 31472

E-mail

bmtlin@nycu.edu.tw

Laboratory

Optimization Theory and Applications Lab

Personal Web

LINK

Optimization Theory and Applications Lab

Office:Management Building.2 MB313B

Extension:57419

Research

Scheduling Theory

Operations Management

Discrete Optimization

Courses

Scheduling Theory and Applications

Advanced Computer Algorithms

Computer Algorithms

Academic Background

  • Computer Science and Information Engineering, National Chiao Tung University

Curriculum Vitae

  • Curriculum Vitae:
  • ．Director, Institute of Information Management, NCTU
  • ．Professor, Department of Information Management and Finance, NCTU
  • ．Professor and Chair, Department of Information Management, National Chi Nan University
  • ．Professor and Chair, Department of Computer Science, Ming Chuan University
  • ．Associate Professor, Department of Information Management, Ming Chuan University
  • ．Visiting Scholar: (1) Department of Industrial & Operations Engineering, University of Michigan, (2) Department of Computer Science, NJIT, (3) Sobolev of Mathematics, Russian Academy of Sciences, (4) IBM T.J. Watson Research Center, N.Y.
  • ．Visiting Professor: (1) Faculty of Physical and Mathematical Sciences, University of Technology Sydney, (2) Warwick Business School, Warwick University
  • ．Senior Research Fellow: Department of Management, The Hong Kong Polytechnic University
  • Journal Editing Services:
  • ．Area editor, NTU Management Review 台大管理論叢 (12/2022~)
  • ．Associate editor, Asia-Pacific Journal of Operational Research (09/2008~)
  • ．Associate editor, Journal of Industrial and Management Optimization (04/2011~)
  • ．Associate editor, Journal of Scheduling (02/2012-)
  • ．Area Editor, Computers & Industrial Engineering (05/2020~)
  • ．Editorial board member, Journal of Applied and Industrial Mathematics, affiliated with Discrete Analysis and Operations Research in Russian (10/2015~)
  • ．Editorial board member, Social Sciences & Humanities Open (10/2018~)
  • ．Editorial board member, International Journal of Planning and Scheduling (09/2009~)
  • ．Editorial review board member, International Journal of Applied Metaheuristic Computing (11/2008~)
  • Resign:
  • ．Area editor, Sun Yat-Sen Management Review中山管理評論 (01/2017~07/2019)
  • ．Editorial board member, International Journal of Production Economics (04/2008~02/2021)
  • ．Editorial advisory board member, Computers and Operations Research (01/2006~09/2019)
  • ．Editorial board member, International Journal of Operations Research (05/2004~10/2008)

Research

  • Scheduling Theory
  • Operations Management
  • Discrete Optimization

Courses

  • Scheduling Theory and Applications
  • Advanced Computer Algorithms
  • Computer Algorithms
  • Data Structures

Journal Paper

  • 1.Dolgui, A., Kovalyov, M.Y., & Lin, B.M.T.* (2022). Maximizing total early work in a distributed two-machine flow-shop. Naval Research Logistics, 69(8), 1124-1137.
  • 2.Chen, X., Miao, Q., Lin, B.M.T.*, Sterna, M., Blazewicz, J. (2021). Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research, 300(2), 504-511.
  • 3.Cheng, T.C.E., Kravchenko, S.A., & Lin, B.M.T.*(2021). Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. Journal of the Operational Research Society, 72(10), 2286-2289.
  • 4.Hao, P.C. & Lin, B.M.T.* (2021). Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing. Computers & Industrial Engineering, 154, 107121.
  • 5.Agnetis, A., Gawiejnowicz, S.*, Lin, B.M.T., & G. Mosheiov (2020). Editorial: Dynamic Scheduling Problems. Journal of Scheduling, 1-2.
  • 6.Kononov, A.V., Kovalyov, M.Y., & Lin, B.M.T.* (2019). Minimizing machine assignment costs over -approximate solutions of the scheduling problem P||Cmax. Theoretical Computer Science, 793, 70-78.
  • 7.Hung, H.C., Lin, B.M.T.*, Posner, M.E., & Wei, J.M. (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. Journal of Scheduling, 22(4), 413-431.
  • 8.Cheng, T.C.E. Kravchenko, S.A., & Lin, B.M.T.* (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics, 66(4), 321-332.
  • 9.Hwang, F.J., & Lin, B.M.T.* (2018). Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Computers and Operations Research, 98, 103-112.
  • 10.Cheng, T.C.E., Kravchenko, S.A., & Lin, B.M.T.* (2017). Preemptive parallel-machine scheduling with a common server to minimize makespan. Naval Research Logistics, 64 (5), 355-434.
  • 11.Lin, B.M.T.*, Hwang, F.J., & Gupta, J.N.D. (2017). Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. Journal of Scheduling, 20(3), 293-302.
  • 12.Yang, C.N., Lin, B.M.T.*, Hwang, F.J., & Wang, M.C. (2016). Acquisition planning and scheduling of computing resources. Computers and Operations Research, 76, 167-182.
  • 13.Tsai, Y.S., & Lin, B.M.T.* (2016). Flow shop non-idle scheduling and resource-constrained scheduling. Annals of Operations Research, 238(1-2), 577-585.
  • 14.Lin, B.M.T.*, Hwang, F.J., & Kononov, A.V. (2016). Relocation scheduling subject to fixed processing sequences. Journal of Scheduling, 19(2), 153-163.
  • 15.Lin, B.M.T.* (2015). Resource-constrained scheduling with optional recycling operations. Computers & Industrial Engineering, 90, 39-45.
  • 16.Kononov, A.V., Lin, B.M.T.*, & Fang, K.T. (2015). Single-machine scheduling with supporting tasks. Discrete Optimization, 17, 69-79.
  • 17.Lin, B.M.T.* (2014). Two-stage flow shop scheduling with dedicated machines. International Journal of Production Research, 53(4), 1094-1097.
  • 18.Lee, K.*, Leung, J.Y.T., Jia, J.H., Li, W., Pinedo, M.L., & Lin, B.M.T. (2014) Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. European Journal of Operational Research, 238(1), 53-64.
  • 19.Hwang, F.J., Kovalyov, M.Y., & Lin, B.M.T.* (2014). Scheduling for fabrication & assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263-279.
  • 20.Lin, B.M.T.*, Lin, Y.Y., & Fang, K.T. (2013). Two-machine flow shop scheduling of polyurethane foam production. International Journal of Production Economics, 141(1), 286-294.
  • 21.Hwang, F.J., Kovalyov, M.Y., & Lin, B.M.T.* (2012). Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discrete Optimization, 9(1), 29-39.
  • 22.Cheng, T.C.E., Lin, B.M.T.*, & Huang, H.L. (2012). Resource-constrained flowshop scheduling with separate resource recycling operations. Computers and Operations Research, 39(6), 1206-1212.
  • 23.Sevastyanov, S.V., Lin, B.M.T.*, & Huang, H.L. (2011). Time complexity analysis in the relocation problem with arbitrary release dates. Theoretical Computer Science, 412(35), 4536-4544.
  • 24.Lin, B.M.T.*, & Cheng, T.C.E. (2012). Concurrent open shop scheduling with centralized and decentralized batching policies. Naval Research Logistics, 58(1), 17-27.
  • 25.Kononov, A.V. & Lin, B.M.T.* (2010). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123-129.
  • 26.Cheng, T.C.E., Lin, B.M.T.*, & Tian, Y. (2009). Minimizing weighted machine load in a two-stage flowshop with a common critical machine. Computers and Operations Research, 36(11), 3031-3040.
  • 27.Lin, F.C., J.S. Hung, J.S.*, & Lin, B.M.T. (2009) A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations. Computers and Operations Research, 36(2), 1158-1175.
  • 28.Cheng, T.C.E. & Lin, B.M.T*. (2009). Johnson’s rule, composite jobs and the relocation problem. European Journal of Operational Research, 192(3), 1008–1013.
  • 29.Lin, B.M.T.*, Lu, C.Y., Shyu, S..J., & Tsai, C.Y. (2008). Development of new features of ant colony optimization for scheduling problems. International Journal of Production Economics, 112(2), 742-755.
  • 30.Lin, B.M.T.* & Liu, S.T. (2008). Maximizing total reward in the relocation problem subject to generalized due dates. International Journal of Production Economics, 115(1), 55-63.
  • 31.Lin, B.M.T.* & Kononov, A.V. (2007). Customer order scheduling to minimize the number of late orders. European Journal of Operational Research, 183(2), 944-948.
  • 32.Lin, B.M.T.*, Cheng, T.C.E. & A.S.C. Chou, A.S.C. (2007). Scheduling in an assembly-type production chain with batch transfer. Omega, 35(2), 143-151.
  • 33.Lin, B.M.T. (2007). Complexity results on single-machine scheduling with positional learning effects, Journal of the Operational Research Society, Vol. 58, No. 8, pp. 1099-1102.
  • 34.Kononov, A.V. & Lin, B.M.T.* (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366-381.
  • 35.Lin, B.M.T.* & Wu, J.M. (2006). Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research, 44(12), 2299-2312.
  • 36.Shyu, S.J.*, Lin, B.M.T., & Hsiao, T.S. (2006). Ant colony optimization algorithm for the cell assignment problem in PCS networks. Computers and Operations Research, 33(6), 1713-1740.
  • 37.Lin, B.M.T.* & Cheng, T.C.E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133 (1-4), 149-161.
  • 38.Hwang, G.J., Lin, T.L. & Lin, B.M.T. (2005). An effective approach for test-sheet composition from large-scale item banks, Computers & Education, Vol. 46, No. 2, pp. 122-139.
  • 39.Lin, B.M.T.* & Jeng, A.A.K. (2004). Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics, 91(2), 121-134
  • 40.Shyu, S.J., Yin, P.Y., & Lin, B.M.T.* (2004). An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research, 131(1-4), 283-304.
  • 41.Jeng, A.A.K. & Lin, B.M.T.* (2004). Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Computers and Operations Research, 32(3), 521-536.
  • 42.Cheng, T.C.E.*, Ding, Q., & Lin, B.M.T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1-13.
  • 43.Lin, B.M.T. & Wu, J.M. (2004). Effective lower bounds for scheduling problems in two-stage hybrid flowshops, Journal of Management (管理學報).
  • 44.Hsu, Y.H. & Lin, B.M.T.* (2003). Algorithms for operations scheduling with linear deterioration. Omega, 31(6), 459-469.
  • 45.Lin, B.M.T. & Cheng, T.C.E.* (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34(11), 1015-1020.
  • 46.Lin, B.M.T.* (2002). Fabrication scheduling in a two-machine flowshop with due date constraints. European Journal of Operational Research, 136(1), 95-105.
  • 47.Lin, B.M.T., & Cheng, T.C.E.* (2001). Batch scheduling in a no-wait two-machine flowshop. Computers and Operations Research, 28(7), 613-624.
  • 48.Lin, B.M.T.* (2001). Scheduling in a two-machine flowshop with due date constraints. International Journal of Production Economics, 70(2), 117-123.
  • 49.Cheng, T.C.E.*, Lin, B.M.T., & Toker, A. (2000). Flowshop batching and scheduling to minimize the makespan. Naval Research Logistics, 47(2), 128-144.
  • 50.Lin, B.M.T., & Cheng, T.C.E.*, Relocation problems to minimize the maximum tardiness and the number of tardy jobs. European Journal of Operational Research, 116(1), 183-193.
  • 51.Cheng, T.C.E.*, Chen, Z.L., Li, C.L., & Lin, B.M.T. (1998). Single machine scheduling to minimize the sum of compression and late costs. Naval Research Logistics, 45(1), 67-82.
  • 52.Oguz, C., Lin, B.M.T., & Cheng, T.C.E.* (1997). Two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 24(12), 1169-1174.
  • 53.Cheng, T.C.E.*, Kovalyov, M.Y., & Lin, B.M.T. (1997). Single machine scheduling to minimize the batch delivery and job earliness penalty. SIAM Journal on Optimization, 7(2), 547-559.
  • 54.Cheng, T.C.E.*, Chen, Z.L., Kovalyov, M.Y., & Lin, B.M.T. (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28(11), 953-956.
  • 55.Cheng, T.C.E., Diamond, J. & Lin, B.M.T. (1993). Optimal scheduling in film production to minimize talent hold cost, Journal of Optimization Theory and Applications, Vol. 79, No. 3, pp. 197-206.
  • 56.Lee, C.Y.*, Cheng, T.C.E., & Lin, B.M.T. (1993). Minimizing the makespan in the three-machine assembly type flow shop problem. Management Science, 39(5), 616-625.

Others

  • 1.H.L. Huang and B.M.T. Lin, Concurrent openshop problem to minimize the weighted number of late jobs, in Multiprocessor Scheduling: Theory and Applications, Ed., Eugene Levner, I-TECH Education and Publishing, 2007, Vienna, Austria.

Lab. Introduction

1. Research：

          We focus on the research of scheduling and optimization theory. We use integer programming, dynamic programming and other methods to find the optimal solution. However, the problem we actually encountered is “hard” and complex. It is difficult to use the above method in a short time to get the solution. We take another method which called meta-heuristic to get the approximate solution, such as ACO (Ant Colony Optimization), PSO (Particle Swarm Optimization)….


2. Meeting:

         The meeting of each semester will be adjusted flexibly and the form of the meeting is open for discussion. Sometimes we need to report papers.


3. Others:

         Dinner with professor every semester and participate in other laboratory activities. In addition to that we also have the opportunity to do academic research with foreign scholars.

Lab. Direction

Scheduling Theory and Applications
Optimization Theory and Applications

Research Tool

Solve the problem tool：Gurobi
Editing tool：LaTex
Program language：No limit

Basic Requirements

Programming
Data structure
Operations Research
Algorithm

Contact

Yi, Huang / eliza85827@gmail.com

Hsiao-Jung, Lin / andreea337@gmail.com

Highlights